A Branch and Bound Method for a Clique Partitioning Problem
نویسندگان
چکیده
[1] J.-P. Barthélemy, B. Leclerc, “The median procedure for partitions”, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 19, 1995, 3-34. [2] I. Charon, O. Hudry, “The noising method: a new combinatorial optimization method”, Operations Research Letters 14, 1993, 133-137. [3] P. Hansen, B. Jaumard, “Cluster analysis and mathematical programming”, Mathematical Programming 79, 1997, 191-215.
منابع مشابه
An Efficient Branch-and-Bound Algorithm Based on MaxSAT for the Maximum Clique Problem
State-of-the-art branch-and-bound algorithms for the maximum clique problem (Maxclique) frequently use an upper bound based on a partition P of a graph into independent sets for a maximum clique of the graph, which cannot be very tight for imperfect graphs. In this paper we propose a new encoding from Maxclique into MaxSAT and use MaxSAT technology to improve the upper bound based on the partit...
متن کاملBranch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
Given a complete graph Kn = (V, E) with edge weight ce on each edge, we consider the problem of partitioning the vertices of graph Kn into subcliques that have at least S vertices, so as to minimize the total weight of the edges that have both endpoints in the same subclique. In this paper, we consider using the branch-and-price method to solve the problem. We demonstrate the necessity of cutti...
متن کاملManuskripte Aus Den Instituten F Ur Betriebswirtschaftslehre Der Universit at Kiel an Exact Algorithm for the Vehicle and Crew Scheduling Problem
We present a model for the vehicle and crew scheduling problem in urban public transport systems by combining models for vehicle and crew scheduling that cover a great variety of real world aspects, especially constraints for crews resulting from wage agreements and internal regulations. The main part of the model consists of a set partitioning formulation to cover the desired trips of the sche...
متن کاملNew bounds and constraint propagation techniques for the clique partitioning problem
This paper considers the problem of clustering the vertices of a complete edge-weighted graph. The objective is to maximize the sum of the edge weights within the clusters (also called cliques). This so-called Clique Partitioning Problem (CPP) is NP-complete, and has several real-life applications such as groupings in flexible manufacturing systems, in biology, in flight gate assignment, etc. N...
متن کاملA branch and bound algorithm for the maximum clique problem
A method to solve the maximum clique problem based on an unconstmin~ quadratic zero-one programming fo~ulation is presented. A branch and bound algorithm for unconstrained quadratic zero-one programming is given that uses a technique to dynamically select variables for the ordering of the branching tree. Dynamic variable selection is equivalent to vertex selection in a similar branch and bound ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010